Towards ‘up to context’ reasoning about higher-order processes
نویسندگان
چکیده
منابع مشابه
Reasoning about Higher-Order Processes
We address the speci cation and veri cation problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulation-based semantics. As a paradigmatic and simple case we concentrate on (Plain) Chocs. We show that Chocs bisimulation can be characterized by an ex...
متن کاملAutomated Higher-order Reasoning about Quantales
Originally developed as an algebraic characterisation for quantum mechanics, the algebraic structure of quantales nowadays finds widespread applications ranging from (non-commutative) logics to hybrid systems. We present an approach to bring reasoning about quantales into the realm of (fully) automated theorem proving. This will yield automation in various (new) fields of applications in the fu...
متن کاملReasoning about Entanglement and Separability in Quantum Higher-Order Functions
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of aliasing for imperative functional programs. Both analyses share similarities notably because they are highly non-compositional. Nevertheless, the intrisic non determinism of quantum computation has a large impact on the ...
متن کاملTowards Reasoning About Context in the Presence of Uncertainty
In this paper we show how the relationships between real world actors and contextual information can be formulated in the presence of uncertainty. In particular, we show how relationship functions can be defined for uncertain numerical context values using interval arithmetic and analogously for context ontologies defined as trees. We illustrate the functions with a small example from our work ...
متن کاملSymbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA processes) where each process manipulates a data structure which can be seen as a nested stack of stacks. Our main result is that, for any higher-order context-free process, the set of all predecessors of a given regula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.09.036